Convergence and perturbation resilience of dynamic string-averaging projection methods
نویسندگان
چکیده
منابع مشابه
Convergence and Perturbation Resilience of Dynamic String-Averaging Projection Methods
We consider the convex feasibility problem (CFP) in Hilbert space and concentrate on the study of string-averaging projection (SAP) methods for the CFP, analyzing their convergence and their perturbation resilience. In the past, SAP methods were formulated with a single predetermined set of strings and a single predetermined set of weights. Here we extend the scope of the family of SAP methods ...
متن کاملConvergence of string-averaging projection schemes for inconsistent convex feasibility problems
We study iterative projection algorithms for the convex feasibility problem of Þnding a point in the intersection of Þnitely many nonempty, closed and convex subsets in the Euclidean space. We propose (without proof) an algorithmic scheme which generalizes both the stringaveraging algorithm and the block-iterative projections (BIP) method with Þxed blocks and prove convergence of the string-ave...
متن کاملBounded perturbation resilience of extragradient-type methods and their applications
In this paper we study the bounded perturbation resilience of the extragradient and the subgradient extragradient methods for solving a variational inequality (VI) problem in real Hilbert spaces. This is an important property of algorithms which guarantees the convergence of the scheme under summable errors, meaning that an inexact version of the methods can also be considered. Moreover, once a...
متن کاملBounded perturbation resilience of projected scaled gradient methods
We investigate projected scaled gradient (PSG) methods for convex minimization problems. These methods perform a descent step along a diagonally scaled gradient direction followed by a feasibility regaining step via orthogonal projection onto the constraint set. This constitutes a generalized algorithmic structure that encompasses as special cases the gradient projection method, the projected N...
متن کاملNorm Convergence of Realistic Projection and Reflection Methods
The (2-set) convex feasibility problem asks for a point contained within the intersection of two closed convex sets of a Hilbert space. Projection and reflection methods represent a class of algorithmic schemes which are commonly used to solve this problem. Some notable projection and reflection methods include the method of alternating projections, the Douglas–Rachford method, the cyclic Dougl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2012
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-012-9491-x